Games for the Strategic Influence of Expectations

We introduce a new class of games where each player's aim is to randomise her strategic choices in order to affect the other players' expectations aside from her own. The way each player intends to exert this influence is expressed through a Boolean combination of polynomial equalities and inequalities with rational coefficients. We offer a logical representation of these games as well as a computational study of the existence of equilibria.Comment: In Proceedings SR 2014, arXiv:1404.041

Games for the Strategic Influence of Expectations

We introduce a new class of games where each player's aim is to randomise her strategic choices in order to affect the other players' expectations aside from her own. The way each player intends to exert this influence is expressed through a Boolean combination of polynomial equalities and inequalities with rational coefficients. We offer a logical representation of these games as well as a computational study of the existence of equilibria. © 2014 V. Bruyère, E. Filiot, M. Randour & J.-F. Raskin.Godo acknowledges support from the Spanish projects EdeTRI (TIN2012-39348-C02-01) and AT (CONSOLIDER CSD 2007-0022). Marchioni acknowledges support from the Marie Curie Intra-European Fellowship NAAMSI (FP7-PEOPLE-2011-IEF).Peer Reviewe

Advances in the theory of μŁΠ algebras

Recently an expansion of ŁΠ1/2 logic with fixed points has been considered [23]. In the present work we study the algebraic semantics of this logic, namely μŁΠ algebras, from algebraic, model theoretic and computational standpoints. We provide a characterisation of free μŁΠ algebras as a family of particular functions from [0,1]n to [0,1]. We show that the first-order theory of linearly ordered μŁΠ algebras enjoys quantifier elimination, being, more precisely, the model completion of the theory of linearly ordered ŁΠ1/2 algebras. Furthermore, we give a functional representation of any ŁΠ1/2 algebra in the style of Di Nola Theorem for MV-algebras and finally we prove that the equational theory of μŁΠ algebras is in PSPACE. © The Author 2010. Published by Oxford University Press. All rights reserved.Marchioni acknowledges partial support of the Spanish projects MULOG2 (TIN2007-68005-C04), Agreement Technologies (CONSOLIDER CSD2007-0022, INGENIO 2010), the Generalitat de Catalunya grant 2009-SGR-1434, and Juan de la Cierva Program of the Spanish MICINN, as well as the ESF Eurocores-LogICCC/MICINN project (FFI2008-03126-E/FILO). Spada acknowledges partially supported of the FWF project P 19872-N18.Peer Reviewe

On triangular norms and uninorms definable in ŁΠ12

AbstractIn this paper, we investigate the definability of classes of t-norms and uninorms in the logic ŁΠ12. In particular we provide a complete characterization of definable continuous t-norms, weak nilpotent minimum t-norms, conjunctive uninorms continuous on [0,1), and idempotent conjunctive uninorms, and give both positive and negative results concerning definability of left-continuous t-norms (and uninorms). We show that the class of definable uninorms is closed under construction methods as annihilation, rotation and rotation–annihilation. Moreover, we prove that every logic based on a definable uninorm is in PSPACE, and that any finitely axiomatizable logic based on a class of definable uninorms is decidable. Finally we show that the Uninorm Mingle Logic (UML) and the Basic Uninorm Logic (BUL) are finitely strongly standard complete w.r.t. the related class of definable left-continuous conjunctive uninorms

Logics for Non-Cooperative Games with Expectations

International audienceWe introduce the logics E(G) for reasoning about probabilistic expectation over classes G of games with discrete polynomial payoff functions represented by finite-valued Lukasiewicz formulas and provide completeness and complexity results. In addition, we introduce a new class of games where players’ expected payoff functions are encoded by E(G)-formulas. In these games each player’s aim is to randomise her strategic choices in order to affect the other players’ expectations over an outcome as well as their own. We offer a logical and computational characterisation of this new class of games

Logics for Non-Cooperative Games with Expectations

We introduce the logics E(G) for reasoning about probabilistic expectation over classes G of games with discrete polynomial payoff functions represented by finite-valued Lukasiewicz formulas and provide completeness and complexity results. In addition, we introduce a new class of games where players' expected payoff functions are encoded by E(G)-formulas. In these games each player's aim is to randomise her strategic choices in order to affect the other players' expectations over an outcome as well as their own. We offer a logical and computational characterisation of this new class of games.Godo acknowledges support from the Spanish projects EdeTRI (TIN2012-39348-C02-01) and AT (CONSOLIDER CSD 2007-0022). Marchioni acknowledges support from the Marie Curie Project NAAMSI (FP7-PEOPLE-2011-IEF).Peer Reviewe

La NIV nel paziente con insufficienza respiratoria cronica, la gestione domiciliare - Competenza specialistica nelle patologie pneumologiche pure

Questo capitolo ha lo scopo di revisionare la letteratura in merito ai meccanismi dell’insufficienza respiratoria cronica e gli effetti fisiologici e l’efficacia della ventilazione meccanica non invasiva nei pazienti affetti da BPCO in fase di stabilità clinica, cercando di dare indicazioni sulla selezione dei pazienti che potrebbero maggiormente beneficiare di questo trattamento

Quantifier elimination and other model-theoretic properties of BL-algebras

This work presents a model-theoretic approach to the study of firstorder theories of classes of BL-chains. Among other facts, we present several classes of BL-algebras, generating the whole variety of BL-algebras whose firstorder theory has quantifier elimination. Model-completeness and decision problems are also investigated. Then we investigate classes of BL-algebras having (or not having) the amalgamation property or the joint embedding property and we relate the above properties to the existence of ultrahomogeneous models. © 2011 by University of Notre Dame.Peer Reviewe

Geometrical aspects of possibility measures on finite domain MV-clans

In this paper, we study generalized possibility and necessity measures on MV-algebras of [0, 1]-valued functions (MV-clans) in the framework of idempotent mathematics, where the usual field of reals ℝ is replaced by the max-plus semiring ℝ max We prove results about extendability of partial assessments to possibility and necessity measures, and characterize the geometrical properties of the space of homogeneous possibility measures. The aim of the present paper is also to support the idea that idempotent mathematics is the natural framework to develop the theory of possibility and necessity measures, in the same way classical mathematics serves as a natural setting for probability theory. © 2012 Springer-Verlag.The authors would like to thank the anonymous referees for their relevant suggestions and helpful remarks They also acknowledge partial support from the Spanish projects TASSAT (TIN2010- 20967-C04-01), Agreement Technologies (CONSOLIDER CSD2007-0022, INGENIO 2010) and ARINF (TIN2009-14704-C03-03), as well as the ESF Eurocores-Log ICCC/MICINN project (FFI2008-03126-E/FILO). Flaminio and Marchioni acknowledge partial support from the Juan de la Cierva Program of the Spanish MICINN.Peer Reviewe

Extending possibilistic logic over Gödel logic

In this paper we present several fuzzy logics trying to capture different notions of necessity (in the sense of possibility theory) for Gödel logic formulas. Based on different characterizations of necessity measures on fuzzy sets, a group of logics with Kripke style semantics is built over a restricted language, namely, a two-level language composed of non-modal and modal formulas, the latter, moreover, not allowing for nested applications of the modal operator N. Completeness and some computational complexity results are shown